Formal Analysis of the Priority Ceiling Protocol

نویسنده

  • Bruno Dutertre
چکیده

We present a case study in formal specification and toolassisted verification of real-time schedulers, based on the priority ceiling protocol. Starting from operational specifications of the protocol, we obtain rigorous proofs of both synchronization and timing properties, and we derive a schedulability result for sporadic tasks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Priority Ceiling Protocol: Formalization and Analysis Using PVS∗

Common real-time operating systems rely on priority-based, preemptive scheduling. Resource sharing in such systems potentially leads to priority inversion: processes of high priority can be prevented from entering a critical section and be delayed by processes of lower priority. Since uncontrolled priority inversion can cause high-priority processes to miss their deadlines, a real-time operatin...

متن کامل

Modelling Real-time Database Systems in Duration Calculus

In this paper, we give a formal model for real-time database systems using Duration Calculus. Our model supports the formal reasoning about the operations in the systems. As a case study for our technique, we give a formal specification and verification of the Read/Write Priority Ceiling Protocol (R/WPCP).

متن کامل

Real-Time Synchronization Protocols with Abortable Critical Sections

Making critical sections abortable is a promising approach to reducing priority inversions. To improve the schedulability of a system using abortable critical sections, the maximum number of abortions should be decreased. In this paper, we propose a real-time synchronization protocol named the ceiling abort protocol (CAP) which introduces a new priority-based abort scheme to the priority ceilin...

متن کامل

A Priority Ceiling Protocol with Dynamic Adjustment of Serialization Order

The difficulties of providing a guarantee of meeting transaction deadlines in hard real-time database systems lie in the problems of priority inversion and of deadlocks. Priority inversion and deadlock problems ensue when concurrency control protocols are adapted in priority-driven scheduling. The blocking delay due to priority inversion can be unbounded, which is unacceptable in the mission-cr...

متن کامل

Synchronous Modeling and Validation of Priority Inheritance Schedulers

Architecture Description Languages (ADLs) allow embedded systems to be described as assemblies of hardware and software components. It is attractive to use such a global modelling as a basis for early system analysis. However, in such descriptions, the applicative software is often abstracted away, and is supposed to be developed in some host programming language. This forbids to take the appli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000